On solving norm equations in global function fields
نویسندگان
چکیده
منابع مشابه
On solving relative norm equations in algebraic number fields
Let Q ⊆ E ⊆ F be algebraic number fields and M ⊂ F a free oE -module. We prove a theorem which enables us to determine whether a given relative norm equation of the form |NF/E (η)| = |θ| has any solutions η ∈ M at all and, if so, to compute a complete set of nonassociate solutions. Finally we formulate an algorithm using this theorem, consider its algebraic complexity and give some examples.
متن کاملSolving norm equations in relative number fields using S-units
In this paper, we are interested in solving the so-called norm equation NL/K(x) = a, where L/K is a given arbitrary extension of number fields and a a given algebraic number of K. By considering S-units and relative class groups, we show that if there exists at least one solution (in L, but not necessarily in ZL), then there exists a solution for which we can describe precisely its prime ideal ...
متن کاملglobal results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Solving sparse linear equations over finite fields
Ahstruct-A “coordinate recurrence” method for solving sparse systems of linear equations over finite fields is described. The algorithms discussed all require O( n,( w + nl) logkn,) field operations, where nI is the maximum dimension of the coefficient matrix, w is approximately the number of field operations required to apply the matrix to a test vector, and the value of k depends on the algor...
متن کاملSolving resultant form equations over number fields
We give an efficient algorithm for solving resultant form equations over number fields. This is the first time that such equations are completely solved by reducing them to unit equations in two variables.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Cryptology
سال: 2009
ISSN: 1862-2976,1862-2984
DOI: 10.1515/jmc.2009.014